Optimality Conditions via Exact Penalty Functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions

In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...

متن کامل

First- and Second-Order Necessary Conditions Via Exact Penalty Functions

In this paper we study firstand second-order necessary conditions for nonlinear programming problems from the viewpoint of exact penalty functions. By applying the variational description of regular subgradients, we first establish necessary and sufficient conditions for a penalty term to be of KKT-type by using the regular subdifferential of the penalty term. In terms of the kernel of the subd...

متن کامل

On Optimality Conditions via Weak Subdifferential and Augmented Normal Cone

In this paper, we investigate relation between weak subdifferential and augmented normal cone. We define augmented normal cone via weak subdifferential and vice versa. The necessary conditions for the global maximum are also stated. We produce preliminary properties of augmented normal cones and discuss them via the distance function. Then we obtain the augmented normal cone for the indicator f...

متن کامل

Scalable Nonlinear Programming via Exact Differentiable Penalty Functions and Trust-Region Newton Methods

We present an approach for nonlinear programming (NLP) based on the direct minimization of an exact differentiable penalty function using trust-region Newton techniques. As opposed to existing algorithmic approaches to NLP, the approach provides all the features required for scalability: it can efficiently detect and exploit directions of negative curvature, it is superlinearly convergent, and ...

متن کامل

Relaxed optimality conditions for mu-differentiable functions

We prove some fundamental properties of mu-differentiable functions. A new notion of local minimizer and maximizer is introduced and several extremum conditions are formulated using the language of nonstandard analysis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2010

ISSN: 1052-6234,1095-7189

DOI: 10.1137/090771016